Robust covariance estimation for distributed principal component analysis
نویسندگان
چکیده
Fan et al. (Ann Stat 47(6):3009–3031, 2019) constructed a distributed principal component analysis (PCA) algorithm to reduce the communication cost between multiple servers significantly. However, their algorithm’s guarantee is only for sub-Gaussian data. Spurred by this deficiency, paper enhances effectiveness of PCA utilizing robust covariance matrix estimators Minsker 46(6A):2871–2903, 2018) and Ke (Stat Sci 34(3):454–471, tame heavy-tailed The theoretical results demonstrate that when sampling distribution symmetric innovation with bounded fourth moment or asymmetric finite 6th moment, statistical error rate final estimator produced similar tails. Extensive numerical trials support indicate our data outliers.
منابع مشابه
Candid Covariance-Free Incremental Principal Component Analysis
Appearance-based image analysis techniques require fast computation of principal components of high-dimensional image vectors. We introduce a fast incremental principal component analysis (IPCA) algorithm, called candid covariance-free IPCA (CCIPCA), used to compute the principal components of a sequence of samples incrementally without estimating the covariance matrix (so covariance-free). The...
متن کاملRobust Kernel Principal Component Analysis
Kernel Principal Component Analysis (KPCA) is a popular generalization of linear PCA that allows non-linear feature extraction. In KPCA, data in the input space is mapped to higher (usually) dimensional feature space where the data can be linearly modeled. The feature space is typically induced implicitly by a kernel function, and linear PCA in the feature space is performed via the kernel tric...
متن کاملRobust Stochastic Principal Component Analysis
We consider the problem of finding lower dimensional subspaces in the presence of outliers and noise in the online setting. In particular, we extend previous batch formulations of robust PCA to the stochastic setting with minimal storage requirements and runtime complexity. We introduce three novel stochastic approximation algorithms for robust PCA that are extensions of standard algorithms for...
متن کاملROBUST PRINCIPAL COMPONENT ANALYSIS? By
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component individually? We prove that under some suitable assumptions, it is possible to recover both the low-rank and the sparse components exactly by solving a very convenient convex program called Principal Component Pursuit; ...
متن کاملRobust Sparse Principal Component Analysis
A method for principal component analysis is proposed that is sparse and robust at the same time. The sparsity delivers principal components that have loadings on a small number of variables, making them easier to interpret. The robustness makes the analysis resistant to outlying observations. The principal components correspond to directions that maximize a robust measure of the variance, with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Metrika
سال: 2021
ISSN: ['0026-1335', '1435-926X']
DOI: https://doi.org/10.1007/s00184-021-00848-9